Based on Bipartite Graph Label Gene Extraction Algorithm of Network Structure
نویسندگان
چکیده
منابع مشابه
Based on Bipartite Graph Label Gene Extraction Algorithm of Network Structure
Firstly we make a pretreatment to the original gene data, and analyze the information of sample gene graph by two steps. First step is removing the unrelated genes; Second step is use an extraction algorithm of label gene based on bipartite network structure to handle the candidate gene, and get gene interactive relationship network. Finally extracts some label gene form the gene interactive re...
متن کاملAn Extension of Community Extraction Algorithm on Bipartite Graph
We introduce a truss decomposition algorithm for bipartite graphs. A subgraph G of a graph is called k-truss if there are at least k-2 triangles containing any edge e of G. By a standard breadth-first-search algorithm, we can compute the truss decomposition for large graphs. To extract a dense substructure that represents community in graph G, this method avoids the intractable problem of cliqu...
متن کاملBipartite Graph for Topic Extraction
This article presents a bipartite graph propagation method to be applied to different tasks in the machine learning unsupervised domain, such as topic extraction and clustering. We introduce the objectives and hypothesis that motivate the use of graph based method, and we give the intuition of the proposed Bipartite Graph Propagation Algorithm. The contribution of this study is the development ...
متن کاملA Novel Collaborative Filtering Algorithm Based on Bipartite Network Projection
In this paper, we present a collaborative filtering algorithm based on the bipartite network projection. First, we project the bipartite network to a weighted directed one-mode network in order to retain original information and extract hidden information. The weight of an edge denotes how important the ending vertex is to the starting one. Then, we implement the algorithm using projection netw...
متن کاملGraph search algorithms and maximum bipartite matching algorithm on the hypercube network model
The parallel algorithms for graph search techniques such as breadth-first search (BFS) and depth-first search (DFS) have been studied by several researchers [2,3,5,7]. In this paper, two parallel search algorithms, one for BFS and the other for DFS, based on the hypercube network model are proposed. In addition, we devise a parallel algorithm to find the maximum matching in bipartite graphs. Bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Biology
سال: 2011
ISSN: 1916-968X,1916-9671
DOI: 10.5539/ijb.v3n4p64